Adaptive Ensemble Classification in P2P Networks.

On Classifying Drifting Concepts in P2P Networks.

Satrap Data and Network Heterogeneity Aware P2P Data%2DMining.

Incremental Maintenance of 2%2DHop Labeling of Large Graphs.

Privacy%2DPreserving Gradient%2DDescent Methods.
Gradient descent is a widely used paradigm for solving many optimization problems. Stochastic gradient descent performs a series of iterations to minimize a target function in order to reach a local minimum. In machine learning or data mining, this function corresponds to a decision model that is to be discovered. The gradient descent paradigm underlies many commonly used techniques in data mining and machine learning, such as neural networks, Bayesian networks, genetic algorithms, and simulated annealing. To the best of our knowledge, there has not been any work that extends the notion of privacy preservation or secure multiparty computation to gradient-descent-based techniques. In this paper, we propose a preliminary approach to enable privacy preservation in gradient descent methods in general and demonstrate its feasibility in specific gradient descent methods.
P2PDocTagger Content management through automated P2P collaborative tagging.
As the amount of user generated content grows, personal information management has become a challenging problem. Several information management approaches, such as desktop search, document organization and (collaborative) document tagging have been proposed to address this, however they are either inappropriate or inefficient. Automated collaborative document tagging approaches mitigate the problems of manual tagging, but they are usually based on centralized settings which are plagued by problems such as scalability, privacy, etc. To resolve these issues, we present P2PDocTagger, an automated and distributed document tagging systembasedonclassification inP2Pnetworks. P2P-DocTagger minimizes the efforts of individual peers and reduces computation and communication cost while providing high tagging accuracy, and eases of document organization/retrieval. Inaddition, weprovidearealistic andflexible simulation toolkit – P2PDMT, to facilitate the development and testing of P2P data mining algorithms. 1.
A Uniform Framework for Ad%2DHoc Indexes to Answer Reachability Queries on Large Graphs.

An EM%2DBased Algorithm for Clustering Data Streams in Sliding Windows.

Incremental and Adaptive Clustering Stream Data over Sliding Window.

Communication%2DEfficient Classification in P2P Networks.

Privacy%2DPreserving Singular Value Decomposition.

Constraint Satisfaction Approach on Product Configuration with Cost Estimation.

Density%2Dbased clustering of data streams at multiple resolutions.

Classification in P2P Networks by Bagging Cascade RSVMs.
Abstract. Data mining tasks in P2P are bound by issues like scalability, peer dynamism, asynchronism, and data privacy preservation. These challenges pose difficulties for deploying conventional machine learning techniques in P2P networks, which may be hard to achieve classification accuracies comparable to regular centralized solutions. We recently investigated the classification problem in P2P networks and proposed a novel P2P classification approach by cascading Reduced Support Vector Machines (RSVM). Although promising results were obtained, the existing solution has some drawback of redundancy in both communication and computation. In this paper, we present a new approach to over the limitation of the previous approach. The new method can effectively reduce the redundancy and thus significantly improve the efficiency of communication and computation, meanwhile it still maintains good classification accuracies comparable to both the centralized solution and the previously proposed P2P solution. Experimental results demonstrate the feasibility and effectiveness of the new P2P classification solution. 1
Cascade RSVM in Peer%2Dto%2DPeer Networks.

Privacy%2DPreserving Linear Fisher Discriminant Analysis.

Preemptive Measures against Malicious Party in Privacy%2DPreserving Data Mining.
Currently, many privacy-preserving data mining (PPDM) algorithms assume the semi-honest model and/or malicious model of multi-party interaction. However, both models are far from able to fully capture the complexity of events and data interactions among parties in the process of secure data mining. In the paper, we study the problem of security violations when a malicious party provides false data. We identify four privacy vulnerabilities of secure scalar product protocols that underlie many current PPDM algorithms. We propose a general more model of two-party interaction and demonstrate its applicability to securely compute (x1 + y1)(x2 + y2) and (x + y) log 2 (x + y) where xi and yi are private values held by each party respectively. We show how the proposed model can be used to securely compute four commonly used kernel functions and other common functions. We also propose two necessary conditions and two basic measures that should be adopted in the current malicious model. 
On incremental maintenance of 2%2Dhop labeling of graphs.
other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the reachability test of nodes. Recently, 2-hop labeling has been proposed to index large collections of XML and/or graphs for efficient reachability tests. However, there has been few work on updates of 2-hop labeling. This is compounded by the fact that Web data changes over time. In response to these, this paper studies the incremental maintenance of 2-hop labeling. We identify the main reason for the inefficiency of updates of existing 2-hop labels. We propose two updatable 2-hop labelings, hybrids of 2-hop labeling, and their incremental maintenance algorithms. The proposed 2-hop labeling is derived from graph connectivities, as opposed to SET COVER which is used by all previous work. Our experimental evaluation illustrates the space efficiency and update performance of various kinds of 2-hop labeling. The main conclusion is that there is a natural way to spare some index size for update performance in 2-hop labeling.


Enabling Mass Customization through Semantic Web Services.

Discovering Frequent Sets from Data Streams with CPU Constraint.

Privacy%2DPreserving Genetic Algorithms for Rule Discovery.
Abstract. Decision tree induction algorithms generally adopt a greedy approach to select attributes in order to optimize some criteria at each iteration of the tree induction process. When a decision tree has been constructed, a set of decision rules may be correspondingly derived. Univariate decision tree induction algorithms generally yield the same tree regardless of how many times it is induced from the same training data set. Genetic algorithms have been shown to discover a better set of rules, albeit at the expense of efficiency. In this paper, we propose a protocol for secure genetic algorithms for the following scenario: Two parties, each holding an arbitrarily partitioned data set, seek to perform genetic algorithms to discover a better set of rules without disclosing their own private data. The challenge for privacy-preserving genetic algorithms is to allow the two parties to securely and jointly evaluate the fitness value of each chromosome using each party’s private data but without compromising their data privacy. We propose a new protocol to address this challenge that is correct and secure. The proposed protocol is not only privacy-preserving at each iteration of the genetic algorithm, the intermediate results generated at each iteration do not compromise the data privacy of the participating parties. 1
Privacy%2DPreserving Self%2DOrganizing Map.
Abstract. Privacy-preserving data mining seeks to allow the cooperative execution of data mining algorithms while preserving the data privacy of each party concerned. In recent years, many data mining algorithms have been enhanced with privacy-preserving feature: decision tree induction, frequent itemset counting, association analysis, k-means clustering, support vector machine, Naïve Bayes classifier, Bayesian networks, and so on. In this paper, we propose a protocol for privacypreserving self-organizing map for vertically partitioned data involving two parties. Self-organizing map (SOM) is a widely used algorithm for transforming data sets to a lower dimensional space to facilitate visualization. The challenges in preserving data privacy in SOM are (1) to securely discover the winner neuron from data privately held by two parties; (2) to securely update weight vectors of neurons; and (3) to securely determine the termination status of SOM. We propose protocols to address the above challenges. We prove that these protocols are correct and privacy-preserving. Also, we prove that the intermediate results generated by these protocols do not violate the data privacy of the participating parties. 1
Estimating product lifecycle cost using a hybrid approach.

An Intelligent Information System for Enabling Product Mass Customization.

Privacy%2Dpreservation for gradient descent methods.
Gradient descent is a widely used paradigm for solving many optimization problems. Stochastic gradient descent performs a series of iterations to minimize a target function in order to reach a local minimum. In machine learning or data mining, this function corresponds to a decision model that is to be discovered. The gradient descent paradigm underlies many commonly used techniques in data mining and machine learning, such as neural networks, Bayesian networks, genetic algorithms, and simulated annealing. To the best of our knowledge, there has not been any work that extends the notion of privacy preservation or secure multiparty computation to gradient-descent-based techniques. In this paper, we propose a preliminary approach to enable privacy preservation in gradient descent methods in general and demonstrate its feasibility in specific gradient descent methods.
Enhancing the Effectiveness of Clustering with Spectra Analysis.

Dynamical Systems for Discovering Protein Complexes and Functional Modules from Biological Networks.

Advances in Knowledge Discovery and Data Mining

Advances in Knowledge Discovery and Data Mining

EStream Online Mining of Frequent Sets with Precise Error Guarantee.

Adaptive Load Shedding for Mining Frequent Patterns from Data Streams.

WDEE Web Data Extraction by Example.

Spectral Kernels for Classification.

Visual Terrain Analysis of High%2DDimensional Datasets.


Agents and Stream Data Mining A New Perspective.
has always been an ongoing issue for many organizations. While data mining has been touted to be the solution, it has failed to deliver the impact despite its successes in many areas. One reason is that data mining algorithms were not designed for the real world, i.e., they usually assume a static view of the data and a stable execution environment where resources are abundant. The reality however is that data are constantly changing and the execution environment is dynamic. Hence, it becomes di#cult for data mining to truly deliver timely and relevant results. Recently, the processing of stream data has received many attention. What is interesting is that the methodology to design stream-based algorithms, which when combined with agents, may well be the solution to the above problem. In this article, we discuss this issue and present some preliminary results of our work in the Matrix project.

Web data extraction based on structural similarity.

Scheduling Queries to Improve the Freshness of a Website.
The WWW is a new advertising media in recent years where corporations utilize it to  increase their exposure to consumers. For a very large website whose content is derived  from some source database, it is important to maintain its freshness in response to  changes to the base data. This issue is particularly signicant for websites presenting  fast changing information such as stock exchange information and product information.  In this paper, we formally dene and study the freshness of a website that is refreshed  by scheduling a set of queries to fetch fresh data from the databases. Then, we propose  several online scheduling algorithms and compare the performance of the algorithms on  the freshness metric. Our conclusion is veried by empirical results.  Keywords: Internet Data Management, View Maintenance, Query Optimization, Hard  Real-Time Scheduling  1 Introduction  The popularity of the World-Wide Web (WWW) has made it a prime vehicle for disseminating information. More and ...
Unloading Unwanted Information From Physical Websites to Personalized Web Views.
With the explosion of information on the Web, information that is made available from websites is generally overwhelming for users surfing the sites. The majority of the users who are facing this information overloading problem are the ordinary home users who do not have much technical knowledge. It is thus important to allow these users to easily create personalized views of websites such that they only see what they want in the way they prefer.
An Automated Algorithm for Extracting Website Skeleton.
The huge amount of information available on the Web has attracted  many research e#orts into developing wrappers that extract data  from webpages. However, as most of the systems for generating wrappers  focus on extracting data at page-level, data extraction at site-level  remains a manual or semi-automatic process. In this paper, we study the  problem of extracting website skeleton, i.e. extracting the underlying hyperlink  structure that is used to organize the content pages in a given  website. We propose an automated algorithm, called the Sew algorithm,  to discover the skeleton of a website. Given a page, the algorithm examines  hyperlinks in groups and identifies the navigation links that point  to pages in the next level in the website structure. The entire skeleton is  then constructed by recursively fetching pages pointed by the discovered  links and analyzing these pages using the same process. Our experiments  on real life websites show that the algorithm achieves a high recall with  moderate precision.
OWDEAH Online Web Data Extraction Based on Access History.

WICCAP From Semi%2Dstructured Data to Structured Data.

Spectral Analysis of Text Collection for Similarity%2Dbased Clustering.

Spectral Analysis of Text Collection for Similarity%2DBased Clustering.

A Spectroscopy of Texts for Effective Clustering.
For many clustering algorithms, such as k-means, EM, and  CLOPE, there is usually a requirement to set some parameters. Often,  these parameters directly or indirectly control the number of clusters to  return. In the presence of di#erent data characteristics and analysis contexts,  it is often di#cult for the user to estimate the number of clusters  in the data set. This is especially true in text collections such as Web  documents, images or biological data. The fundamental question this paper  addresses is: &#034;How can we e#ectively estimate the natural number of  clusters in a given text collection?&#034;. We propose to use spectral analysis,  which analyzes the eigenvalues (not eigenvectors) of the collection, as the  solution to the above. We first present the relationship between a text  collection and its underlying spectra. We then show how the answer to  this question enhances the clustering process. Finally, we conclude with  empirical results and related work.
Towards building logical views of websites.

Towards building logical views of websites.

Personalized Web Views for Multilingual Web Sources.

Blocking Reduction Strategies in Hierarchical Text Classification.

A Support%2DOrdered Trie for Fast Frequent Itemset Discovery.

Parameter driven synthetic web database generation.

A Java%2Dbased digital library portal for geography education.

CrystalBall  A Framework for Mining Variants of Association Rules.

ENAXS Efficient Native XML Storage System.

Efficient Web Log Mining for Product Development.

An Architectural Framework for Native XML Data Management.

Modelling and Predicting Web Page Accesses Using Markov Processes.

A Visual Interface for Native XML Database.

FSSM Fast Construction of the Optimized Segment Support Map.
Computing the frequency of a pattern is one of the key operations  in data mining algorithms. Recently, the Optimized Segment  Support Map (OSSM) was introduced as a simple but powerful way of  speeding up any form of frequency counting satisfying the monotonicity  condition. However, the construction cost to obtain the ideal OSSM  is high, and makes it less attractive in practice. In this paper, we propose  the FSSM, a novel algorithm that constructs the OSSM quickly  using a FP-Tree. Given a user-defined segment size, the FSSM is able  to construct the OSSM at a fraction of the time required by the algorithm  previously proposed. More importantly, this fast construction  time is achieved without compromising the quality of the OSSM. Our  experimental results confirm that the FSSM is a promising solution for  constructing the best OSSM within user given constraints.
Parameterless Data Compression and Noise Filtering Using Association Rule Mining.

On Querying Geospatial and Georeferenced Metadata Resources in G%2DPortal.
G-Portal is a web portal system providing a range of digital library services to access geospatial and georeferenced resources on the Web. Among them are the storage and query subsystems that provide a central repository of metadata resources organized under different projects. In GPortal, all metadata resources are represented in XML (Extensible Markup Language) and they are compliant to some resource schemas defined by their creators. The resource schemas are extended versions of a basic resource schema making it easy to accommodate all kinds of metadata resources while maintaining the portability of resource data. To support queries over the geospatial and georeferenced metadata resources, a XQuery-like query language known as (Resource Query Language) has been designed. In this paper, we present the language features and provide some experimental findings about the storage design and query evaluation strategies for queries.
Representation of Web Data in A Web Warehouse.

Constraint%2Ddriven join processing in a Web Warehouse.

Deriving and verifying statistical distribution of a hyperlink%2Dbased Web page quality metric.

Detecting and Representing Relevant Web Deltas in WHOWEDA.
In this paper, we present a mechanism for detecting and representing changes given the old and new versions of a set of interlinked Web documents, retrieved in response to a user’s query. In particular, we show how to detect and represent web deltas, i.e., changes in the Web documents that are relevant to a user’s query in the context of our web warehousing system called Whoweda (W arehouse of Web Data). In Whoweda, Web information are materialized views stored in web tables in the form of web tuples. These web tuples, represented as directed graphs, can be manipulated using a set of web algebraic operators. In this paper, we present a mechanism to detect relevant web deltas using web algebraic operators such as the web join and the outer web join. Web join is used to detect identical documents residing in two web tables whereas outer web join, a derivative of web join is used to identify dangling web tuples. We show how to represent these changes using delta web tables. We develop formal algorithms for the generation of delta web tables identifying web documents which have been added, deleted or modified since the last query.
Data model for warehousing historical Web information.

Performance measurement framework for hierarchical text classification.
Hierarchical text classification or simply hierarchical classification refers to assigning a document to one or more suitable categories from a hierarchical category space. In our literature survey, we have found that the existing hierarchical classification experiments used a variety of measures to evaluate performance. These performance measures often assume independence between categories and do not consider documents misclassified into categories that are similar or not far from the correct categories in the category tree. In this paper, we therefore propose new performance measures for hierarchical classification. The proposed performance measures consist of category similarity measures and distance-based measures that consider the contributions of misclassified documents. Our experiments on hierarchical classification methods based on SVM classifiers and binary Naïve Bayes classifiers showed that SVM classifiers perform better than Naïve Bayes classifiers on Reuters-21578 collection according to the extended measures. A new classifier-centric measure called blocking measure is also defined to examine the performance of subtree classifiers in a top-down levelbased hierarchical classification method.
3rd International Conference on Web Information Systems Engineering %28WISE 2002%29

3rd International Conference on Web Information Systems Engineering Workshops %28WISE 2002 Workshops%29

Deriving and Verifying Statistical Distribution of a Hyperlink%2DBased Web Page Quality Metric.

Web Informetrics Extending Classical Informetrics to the Web.

Constraint%2DFree Join Processing on Hyperlinked Web Data.

Modelling and Predicting Web Page Accesses Using Burrell%27s Model.

Personalized Classification for Keyword%2DBased Category Profiles.
Personalized classification refers to allowing users to define  their own categories and automating the assignment of documents to  these categories. In this paper, we examine the use of keywords to define  personalized categories and propose the use of Support Vector Machine  (SVM) to perform personalized classification. Two scenarios have been  investigated. The first assumes that the personalized categories are defined  in a flat category space. The second assumes that each personalized  category is defined within a pre-defined general category that provides a  more specific context for the personalized category. The training documents  for personalized categories are obtained from a training document  pool using a search engine and a set of keywords. Our experiments have  delivered better classification results using the second scenario. We also  conclude that the number of keywords used can be very small and increasing  them does not always lead to better classification performance.
Wiccap Data Model Mapping Physical Websites to Logical Views.
Information sources over the WWW contain a large amount of data organized according to different interests and values. Thus, it is important that facilities are there to enable users to extract information of interests in a simple and effective manner. To do this, information from the Web sources need to be extracted automatically according to users&#039; interests. However, the extraction of information requires in-depth knowledge of relevant technologies and the extraction process is slow, tedious and difficult for ordinary users. We propose the Wiccap Data Model, an XML data model that maps Web information sources into commonly perceived logical models. Based on this data model, ordinary users are able to extract information easily and efficiently. To accelerate the creation of data models, we also define a formal process for creating such data model and have implemented a software tool to facilitate and automate the process of producing Wiccap Data Models.
G%2DPortal a map%2Dbased digital library for distributed geospatial and georeferenced resources.
As the World Wide Web evolves into an immense information network, it is tempting to build new digital library services and expand existing digital library services to make use of web content. In this paper, we present the design and implementation of G-Portal, a web portal that aims to provide digital library services over geospatial and georeferenced content found on the World Wide Web. G-Portal adopts a map-based user interface to visualize and manipulate the distributed geospatial and georeferenced content. Annotation capabilities are supported, allowing users to contribute geospatial and georeferenced objects as well as their associated metadata. The other features included in GPortal &#039;s design are query support, content classification, and content maintenance. This paper will mainly focus on the architecture design, visualization and annotation capabilities of G-Portal.
Mining Relationship Graphs for Effective Business Objectives.
Modern organization has two types of customer profiles: active and passive. Active customers contribute to the business goals of an organization, while passive customers are potential candidates that can be converted to active ones. Existing KDD techniques focused mainly on past data generated by active customers. The insights discovered apply well to active ones but may scale poorly with passive customers. This is because there is no attempt to generate know-how to convert passive customers into active ones. We propose an algorithm to discover relationship graphs using both types of profile. Using relationship graphs, an organization can be more effective in realizing its goals.
Efficient k Nearest Neighbor Queries on Remote Spatial Databases Using Range Estimation.
K-Nearest Neighbor (k-NN) queries are used in GIS and CAD/CAM applications to find the k spatial objects closest to some given query points. Most previous k-NN research has assumed that the spatial databases to be queried are local, and that the query processing algorithms have direct access to their spatial indices; e.g., R-trees. Clearly, this assumption does not hold when k-NN queries are directed at remote spatial databases that operate autonomously. While it is possible to replicate some or all the spatial objects from the remote databases in a local database and build a separate index structure for them, such an alternative is infeasible when the database is huge, or there are large number of spatial databases to be queried. In this paper, we propose a k-NN query processing algorithm that uses one or more window queries to retrieve the nearest neighbors of a given query point. We also propose two di#erent methods to estimate the ranges to be used by the window queries. Each range estimation method requires di#erent statistical knowledge about the spatial databases. Our experiments on the TIGER data allow us to study the behavior of the proposed algorithm using di#erent range estimation methods. Apart from not requiring direct access to the spatial indices, the window queries used in the proposed algorithm can be easily supported by non-spatial database systems containing spatial objects.
A visual tool for building logical data models of websites.
Information sources over the WWW contain a large amount of data organized according to different interests and values. Thus, it is important that facilities are there to enable users to extract information of interest in a simple and effective manner. To do this, We propose the Wiccap Data Model, an XML data model that maps Web information sources into commonly perceived logical models, so that information can be extracted automatically according to users&#039; interests. To accelerate the creation of data models, we have implemented a visual tool, called the Mapping Wizard, to facilitate and automate the process of producing Wiccap Data Models. Using the tool, the time required to construct a logical data model for a given website is significantly reduced.
Web classification using support vector machine.
In web classification, web pages from one or more web sites are assigned to pre-defined categories according to their content. Since web pages are more than just plain text documents, web classification methods have to consider using other context features of web pages, such as hyperlinks and HTML tags. In this paper, we propose the use of Support Vector Machine (SVM) classifiers to classify web pages using both their text and context feature sets. We have experimented our web classification method on the WebKB data set. Compared with earlier Foil-Pilfs method on the same data set, our method has been shown to perform very well. We have also shown that the use of context features especially hyperlinks can improve the classification performance significantly.
Online and Incremental Mining of Separately%2DGrouped Web Access Logs.


Evaluating Web Access Log Mining Algorithms A Cognitive Approach.

A survey of Web metrics.
... this article, we examine this issue by classifying and discussing a wide  ranging set of Web metrics. We present the origins, measurement functions,  formulations and comparisons of well-known Web metrics for quantifying Web graph  properties, Web page significance, Web page similarity, search and retrieval, usage  characterization and information theoretic properties. We also discuss how these metrics  can be applied for improving Web information access and use.
What can a web bag discover for you%3F


Anatomy of the coupling query in a web warehouse.

Rapid Association Rule Mining.
Advanced data mining technologies and the large quantities of Remotely Sensed Imagery provide a data mining opportunity with high potential for useful results. Extracting interesting patterns and rules from data sets composed of images and associated ground data, can be of importance in precision agriculture, community planning, resource discovery and other areas. However, in most cases the image data sizes are too large to be mined in a reasonable amount of time using standard methods. A new spatial data organization, bit Sequential organization (bSQ) and a new &#034;data-mining ready&#034; data structure, the Peano Count Tree (Ptree) provide a lossless and compressed representation of image data which facilitate association rule mining, classification and other data mining techniques markedly. In this paper we propose a new model for association rule mining and classification on spatial datasets using Ptrees. Experimental results show the new model applies well to data mining on Remotely Sensed Imagery data.
Improving the Fairness of Timely Refresh of Web Views.

Query Integration for Refreshing Web Views.

ViDE A Visual Data Extraction Environment for the Web.

On Formulation of Disjunctive Coupling Queries in WHOWEDA.

Imposing Disjunctive Constraints on Inter%2Ddocument Structure.

An Information Concierge for the Web.
WWW Information Collection, Collaging and Programming (WICCAP) system is a software system for the generation of logical views of web resources, and the extraction of desired information in the form of a structured document. It is designed to enable people to obtain information of interests in a simple and effective manner as well as to make information from the WWW accessible to applications so as to afford automation, inter-operation and Web-awareness among services. A key factor in making this system useful in practice is that it provides tools to automate and facilitate the process of constructing logical representation of websites, to identify and define information of interest, and to retrieving them. In this paper, we present the design of the WICCAP system and its two main components, namely Mapping Wizard and Network Extraction Agent.
Cooperative Multi%2DAttribute Bilateral Online Negotiation for E%2DCommerce.

Fast Online Dynamic Association Rule Mining.

Schemas for web data a reverse engineering approach.

Ontologies and Electronic Commerce.

Re%2Dengineering structures from Web documents.
To realise a wide range of applications (including digital libraries) on the Web, a more structured way of accessing the Web is required and such requirement can be facilitated by the use of XML standard. In this paper, we propose a general framework for reverse engineering (or re-engineering) the underlying structures i.e., the DTD from a collection of similarly structured XML documents when they share some common but unknown DTDs. The essential data structures and algorithms for the DTD generation have been developed and experiments on real Web collections have been conducted to demonstrate their feasibility. In addition, we also proposed a method of imposing a constraint on the repetitiveness on the elements in a DTD rule to further simplify the generated DTD without compromising their correctness.
Storage Management of a Historical Web Warehousing System.

Financial Advisor Agent in a Multi%2DAgent Financial Trading System.

Web Schemas in WHOMEDA.

Keeping a Very Large Website Up%2Dto%2Ddate Some Feasibility Results.
. As websites grow large and become more sophisticated, organizations  use structured database systems as a source of base data  for information on the website. Thus, it has become critical to keep a  very large website up-to-date in response to the frequent changes in base  data. This gives rise to an important issue: Can a website be timely refreshed  by executing a set of queries against the base data? In this paper,  we investigate the feasibility of scheduling a set of queries to refresh a  very large website. Based on two types (tight and loose) of feasibility  requirements, we present feasibility results when the base data change  with uniform, regular and random periods. We found that tight feasibility  depends on the interval length between two consecutively raised cell  refresh requests while it is NP-Hard to determine loose feasibility when  the base data have regular or random update periods. For the case when  the base data have the uniform update periods, loose feasibilit...
On Warehousing Historical Web Information.

Detecting and Representing Relevant Web Deltas using Web Join.

Reducing Cognitive Overheads in a Web Warehouse Using Reverse%2DOsmosis.

eBroker An Agent%2DBased Query Routing System for Distributed E%2DCommerce Databases.

DTD%2DMiner A Tool for Mining DTD from XML Documents.
The World-Wide Web (WWW) is one of the richestrepositories of information in the world today. People no longer use the Web simply for browsing but also for nu-merous E-Commerce applications like making airline ticket and hotel reservations, and performing banking transac-tions. Nevertheless, for Web based E-commerce to be successful, one has to overcome the interoperability issues be-tween different E-commerce sites. At present, most of the E-commerce sites present their products and services inWeb documents that are not very well structured.
Model and Research Issues for Refreshing a Very Large Website.
The WWW is a new advertising media in recent years where corporations utilize it to increase their exposure to consumers. Although there has been much work on WWW information management, research in keeping information on websites up-to-date is still in its infancy. For a very large website whose content is derived from some source databases, it is important to maintain its freshness in response to changes to the base data. This issue is particularly significant for websites presenting fast changing information such as stock exchange information and product information. In this paper, we propose a model for studying the problem of refreshing a very large website in time and identify several important research issues in maintaining the currency of information on such websites. We also discuss possible approaches to timely refresh a website under the framework.  1. Introduction  The popularity of the World-Wide Web (WWW) has made it a prime vehicle for disseminating information. More and...
Cost%2Dbenefit analysis of web bag in a web warehouse An analytical approach.

Global View Maintenance by Using Inference Relationship among Views.
. Previous work on view maintenance mostly focused on updating  a single view at a time. However, to maintain a large warehouse  whose source data changes rapidly, an overall maintenance strategy is  needed. This paper concentrates on reducing the time taken for updating  an entire set of related SPJ views based on the logical inference relationships  among the views. Updating a view in response to the changes of the  source data needs two types of computations: decision computation and  refresh computation. The decision computation determines whether the  source change aects the view while the refresh computation installs the  source change into the view. By investigating the inference relationships  among SPJ queries based on boolean expression relationships, an algorithm  is developed to reduce the necessary computation for maintaining  a set of views. The more related the SPJ views in the warehouse are, the  better the performance of the algorithm is expected to be.  1 Introductio...
Data Visualization Operators for WHOWEDA.

An Overview of the Agent%2DBased Electronic Commerce System %28ABECOS%29 Project.

Heterogeneous product description in electronic commerce.

Cost%2Dbenefit analysis of web bag in a web warehouse An analytical approach.


Are Life%2DLike Characteristics Useful for Autonomous Agents%3F

ZBroker A Query Routing Broker for Z39.50 Databases.
A query routing broker is a software agent that determines from a large set of accessing information sources the ones most relevant to a user&#039;s information need. As the number of information sources on the Internet increases dramatically, future users will have to rely on query routing brokers to decide a small number of information sources to query without incurring too much query processing overheads. In this paper, we describe a query routing broker known as ZBroker developed for bibliographic database servers that support the Z39.50 protocol. ZBroker samples the content of each bibliographic database by using training queries and their results, and summarizes the bibliographic database content into a knowledge base. We present the design and implementation of ZBroker and describe its Web-based user interface.  KEYWORDS: query routing, bibliographic databases, digital libraries  1. INTRODUCTION  As the number of information sources increases rapidly on the Internet, users are beginn...
Pi%2DWeb Join in a Web Warehouse.

Cluster%2DBased Database Selection Techniques for Routing Bibliographic Queries.
this paper, we focus on the database selection problem in the context of a global digital library consisting of a large number of online bibliographic servers. Each server hosts a bibliographic database that contains bibliographic records each of which consists of text values for a number of pre-defined bibliographic attributes such as title, author, call number, subject, etc.. Each bibliographic database supports user queries on the bibliographic attributes. Since  bibliographic records are relatively small in size, we only consider bibliographic databases that support boolean queries on the bibliographic attributes, and the query results are not ranked. While focusing on bibliographic databases, we believe that our proposed solution can be extended to handle other databases that contain searchable text attributes. Formally, we define a general database selection problem as follows:
On the Feasibility of Website Refresh Queries.


Locating Web Information Using Web Checkpoints.
Conventional search engines locate information by letting users establish a single web checkpoint . By specifying one or more keywords, users direct search engines to return a set of documents that contain those keywords. From the documents (links) returned by search engines, user proceed to further probe the WWW from there. Hence, these initial set of documents (contingent upon the occurrence of keyword(s)) serve as a web checkpoint. Generally, these links are numerous and may not result in much fruitful searches. By establishing multiple web checkpoints, a richer and controllable search procedure can be constructed to obtain more relevant Web information. This paper presents the design and implementation of permitting multiple checkpoints to facilitate improved searching on the WWW. Web checkpointing is performed as part of the  Whoweda project. 1 Introduction  Today, business organizations are turning to information on the WWW to assist in their decision making process instead of re...
WEDAGEN %2D A Synthetic Web Database Generator.

Non%2DRepudiation in an Agent%2DBased Electronic Commerce System.
Abecos is an agent-based e-commerce system under development at the Nanyang Technological  University. It aims to provide a software infrastructure for a large scale, distributed  system whereby seller and buyer (software) agents engage in e-commerce activities  on behalf of organizations and individuals. A key factor in making this system  usable in practice is strict security controls. One aspect of security is the provision of  non-repudiation services. As protocols for non-repudiation have focused on the singlemessage  non-repudiation, its adaptation to afford non-repudiation in a communication  session for two agents in Abecos is inefficient. In this work, we investigate and propose  a protocol for enforcing non-repudiation in a session. We compare and show that it is  more efficient than simple adaptations of existing protocols.  Keywords: Electronic Commerce, Security, Non-Repudiation Protocol  1 Introduction  Electronic commerce is an emerging paradigm of business on the fast g...
Research Issues in Web Data Mining.

Algebraic Operations on Bags in a Web Warehouse.

Cost%2DBenefit Analysis of Web Bag in a Web Warehouse.

ZBroker A Query Routing Broker for Z39.50 Databases
A query routing broker is a software agent that determines from a large set of accessing information sources the ones most relevant to a user&#039;s information need. As the number of information sources on the Internet increases dramatically, future users will have to rely on query routing brokers to decide a small number of information sources to query without incurring too much query processing overheads. In this paper, we describe a query routing broker known as ZBroker developed for bibliographic database servers that support the Z39.50 protocol. ZBroker samples the content of each bibliographic database by using training queries and their results, and summarizes the bibliographic database content into a knowledge base. We present the design and implementation of ZBroker and describe its Web-based user interface.  KEYWORDS: query routing, bibliographic databases, digital libraries  1. INTRODUCTION  As the number of information sources increases rapidly on the Internet, users are beginn...
Database Selection Techniques for Routing Bibliographic Queries.
Query routing (also known as server ranking and collection fusion in some specific context) refers to the general problem of selecting from a large set of accessible information sources the ones relevant to a given query, and evaluating the query on the selected sources. It consists of three steps, namely database selection, query evaluation, and  result merging. As the number of information sources on the Internet increases dramatically, query routing is becoming increasingly important. Much of the previous work in query routing focused on information sources that are document collections. In this paper, we address the query routing problem for databases with multiple text attributes. In particular, we have proposed a number of different database selection methods each requiring different types of knowledge about the databases&#039; content, e.g. past queries, past query results, and statistical information collected from the database records. By conducting a series of experiments on a set...
Querying Structured Web Resources.
this paper, we do not attempt to address the problem of tagging web pages. We will however focus on the idea of structured web queries and their result representation. STRUCTURED RETRIEVAL QUERIES
Web Warehousing An Algebra for Web Information.
While conventional keyword indexes maintained by web search engines such as Yahoo, Lycos, and World Wide Web Worm work well for most simple keyword searches, they are inadequate when more complex and structured queries involving the underlying hypertext structure of the World Wide Web are desired. Building from a database perspective, existing work to support such queries focuses on constructing SQL-like query languages for the WWW that assumes a relational abstraction of the WWW. Nonetheless, the WWW is a directed graph and imposing a relational abstraction filters out its inherent topological structure. In this paper, we propose a data model for the WWW that retains its topological structure and construct a web algebra to manipulate objects in this model. The web algebra establishes a formal foundation from which different web query languages can be designed. 1 Introduction  From a user&#039;s perspective, the World Wide Web is a broadcast medium where a wide range of up-to-date informati...
Join Processing in Web Databases.
. Recently, there has been increasing interests in data models and query languages for unstructured data in the World Wide Web. When web data is harnessed in a web warehouse, new and useful information can be derived through appropriate information manipulation. In our web warehousing project, we introduce a new operator called the web join. Like its relational counterpart, web join combines information from two web tables to yield a new web table. This paper discusses various issues in web join such as join semantics, joinability, and join evaluation. 1 Introduction  Given the high rate of growth of the volume of data available on the WWW, locating information of interest in such an anarchic setting becomes a more difficult process everyday. Thus, there is the recognition of the undeferring need for effective and efficient tools for information consumers, who must be able to easily locate and manipulate information in the Web. We aim to build a web warehouse containing information ext...
Information Coupling in Web Databases.
Web information coupling refers to an association of topically related web documents. This coupling is initiated explicitly by a user in a web warehouse specially designed for web information. Web information coupling provides the means to derive additional, useful information from the WWW. In this paper, we discuss and show how two web operators, i.e., global web coupling and local web coupling , are used to associate related web information from the WWW and also from multiple web tables in a web warehouse. This paper discusses various issues in web coupling such as coupling semantics, coupling-compability, and coupling evaluation. 1 Introduction  Given the high rate of growth of the volume of data available on the WWW, locating information of interest in such an anarchic setting becomes a more difficult task everyday. Thus, there is the recognition of the undeferring need for effective and efficient tools for information consumers, who must be able to easily locate and manipulate inf...
Data Visualization in a Web Warehouse.

Web Warehousing Design and Issues.

A Preliminary Study of Genetic Data Compression.

Web Bags %2D Are They Useful in A Web Warehouse%3F
Sets and bags are closely related structures. A bag is different from a set in that it is sensitive to the number of times an element occurs while a set is not. In this paper, we introduce the concept of web bag in a web warehouse as a part of our  Web Information Coupling System(WICS). Informally, a web bag is a web table  which allows multiple occurrences of identical web tuples. Web bag helps to discover useful knowledge from a web table such as visible documents (or web sites), luminous  documents and luminous paths. We formally discuss the semantics and properties of web bags, and illustrate with examples applications of web bag in knowledge discovery in a web warehouse. 1 Introduction  Sets and bags are closely related structures. When a set is allowed to have multiple occurrences of a member, it is called a bag or multi-set [29]. While a set of tuples (i.e., a relation) is a simple, natural model of data as it might appear in a database, commercial systems are rarely if ever bas...
A Relational Interface for Heterogeneous Information Sources.

Block%2DOriented Compression Techniques for Large Statistical Databases.
Abstract—Disk I/O has long been a performance bottleneck for very large databases. Database compression can be used to reduce disk I/O bandwidth requirements for large data transfers. In this paper, we explore the compression of large statistical databases and propose techniques for organizing the compressed data such that standard database operations such as retrievals, inserts, deletes and modifications are supported. We examine the applicability and performance of three methods. Two of these are adaptations of existing methods, but the third, called Tuple Differential Coding (TDC) [16], is a new method that allows conventional access mechanisms to be used with the compressed data to provide efficient access. We demonstrate how the performance of queries that involve large data transfers can be improved with these database compression techniques. Index Terms—Database compression, data compression, physical organization, statistical database. 1
Vector Quantizer Design Using Genetic Algorithms.

Information Synthesis in Statistical Databases.

Coterie Templates A New Quorum Construction Method.

Relational Database Compression Using Augmented Vector Quantization.

A Preliminary Study of Genetic Data Compression.

A Tuple Model for Summary Data Management .

On%2DLine Detection and Resolution of Communication Deadlocks.
We present a new distributed algorithm that de-tects and resolves communication deadlocks on-line, i.e., simultaneously detects and resolves deadlock as communication requests are made, at no additional message trafic overhead, and with bounded delay be-tween the occurrence and detection of a deadlock. This is achieved via a novel technique for detecting knots, which sufice for the existence of communication dead-locks. Current distributed deadlock detection algo-rithms lack these features. Thus the algorithm is suit-able for sofl real-time systems and large distributed systems. We also prove that the algorithm detects communication deadlocks and that it is able to deal with false deadlocks. 1
A Physical Storage for Efficient Statistical Query Processing.

